Semanti Che king in HPJava

An Expressive , S alable Type Theory for Certi edCodeKarl

Code Karl Crary Joseph C. Vanderwaart May 1, 2001 CMU-CS-01-113 S hool of Computer S ien e Carnegie Mellon University Pittsburgh, PA 15213 Abstra t We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logi al proposition and proof. The in lusion of expli it proofs allows the type system to guarantee properties that would otherwise ...

HPJava: Efficient Compilation and Performance for HPC

We review the authors’ HPJava programming environment , and compare and contrast with systems like HPF. Because the underlying programming language is Java, and because the HPJava programming model relies centrally on object-oriented run-time descriptors for distributed arrays, the achievable performance has been somewhat uncertain. In the latest publication [15], we have proved that HPJava ind...

Regular Model Che king 52 Model Che king Context - Free Properties 53

From Rewrite Rules to Bisimulation Congruen es

The dynami s of many al uli an be most learly de ned by a redu tion semanti s. To work with a al ulus, however, an understanding of operational ongruen es is fundamental; these an often be given tra table de nitions or hara terisations using a labelled transition semanti s. This paper onsiders al uli with arbitrary redu tion semanti s of three simple lasses, rstly ground term rewriting, then le...

HPJava: a data parallel programming alternative

The HPJava (high-performance Java) project aims to support scientific and parallel computing in a modern, object-oriented, Internet-friendly en-vironment—the Java platform. HPJava leverages popular high-performance Fortran (HPF) language and library features such as " scientific " multidi-mensional array syntax and distributed arrays, while at a more language-independent level, it introduces a ...